| Endre Szemerédi | |
|---|---|
Endre Szemerédi
|
|
| Born | August 21, 1940 Hungary |
| Nationality | Hungary |
| Fields | Computer science |
| Institutions | Rutgers University |
| Alma mater | Moscow State University |
| Doctoral advisor | Israil Moiseivich Gelfand |
| Doctoral students | Jaikumar Radhakrishnan Ali Shokoufandeh Ryan Martin Sachin Lodha Gabor Sarkozy Bela Csaba Ayman Khalfallah Sarmad Abbasi |
| Notable awards | Pólya Prize (1975) Rolf Schock Prizes (2008) Leroy P. Steele Prize (2008) Alfréd Rényi Prize (1973) Member NAS |
Endre Szemerédi (born August 21, 1940) is a Hungarian mathematician, working in the field of combinatorics and theoretical computer science. He is the State of New Jersey Professor of computer science at Rutgers University since 1986. He has held visiting positions at Stanford University (1974), McGill University (1980), University of South Carolina (1981–1983) and University of Chicago (1985–1986). He was born in Budapest, studied in Eötvös Loránd University in Budapest and received his PhD from Moscow State University. His adviser was the late mathematician Israel Gelfand.[1]
Contents |
Endre Szemerédi has published over 200 scientific articles in the fields of Discrete Mathematics, Theoretical Computer Science, Arithmetic Combinatorics and Discrete Geometry.[2] He is best known for his proof from 1975 of an old conjecture of Paul Erdős and Paul Turán: if a sequence of natural numbers has positive upper density then it contains arbitrarily long arithmetic progressions. This is now known as Szemerédi's theorem. One of the key tools introduced in his proof is now known as the Szemerédi regularity lemma, which has become a very important tool in combinatorics.
He is also known for the Szemerédi-Trotter theorem in incidence geometry and the Hajnal-Szemerédi theorem in graph theory.Ajtai and Szemerédi proved the corners theorem, an important step toward higher dimensional generalizations of the Szemerédi theorem. With Ajtai and Komlós he proved the ct2/log t upper bound for the Ramsey number R(3,t). With Ajtai, Chvátal, and M. M. Newborn, Szemerédi proved the famous Crossing Lemma, that a graph with n vertices and m edges, where m > 4n has at least m3 / 64n2 crossings.
Szemeredi has won numerous awards and honors for his contribution to mathematics and computer science. A few of them are listed here:
Endre Szemeredi is a corresponding member (1982), and member (1987) of the Hungarian Academy of Sciences and a member (2010) of the National Academy of Sciences. He is also a member of the Institute for Advanced Study (IAS), Princeton University (2007–2010) and a permanent research fellow at the Rényi Institute of Mathematics, Budapest.
He was the Fairchild Distinguished Scholar at CALTECH in 1987-88.
Prof. Szemeredi is an honorary doctor[4] of the Charles University, Prague.
He was the lecturer in the Forty-Seventh Annual DeLong Lecture Series [5] at University of Colorado.
He is also a recipient of the Aisenstadt Chair at CRM,[6] University of Montreal. In 2008 he was the Eisenbud Professor at MSRI Berkeley.
On August 2–7, 2010, the Alfréd Rényi Institute of Mathematics and the János Bolyai Mathematical Society organized a conference in honor of 70th birthday of Endre Szemeredi.[7]
Prior to the conference a volume of the Bolyai Society Mathematical Studies Series, An Irregular Mind, a collection of papers edited by Imre Bárány and József Solymosi, was published to celebrate Szemerédi's achievements on the occasion of his 70th birthday.[8][9]
|
||||||||||||||